Lectures 1 & 2 : Introduction to Secure Computation , Yao ’ s and GMW Protocols
نویسنده
چکیده
Secure multiparty computation considers the problem of different parties computing a joint function of their separate, private inputs without revealing any extra information about these inputs than that is leaked by just the result of the computation. This setting is well motivated, and captures many different applications. Considering some of these applications will provide intuition about how security should be defined for secure computation:
منابع مشابه
GMW vs. Yao? Efficient Secure Two-Party Computation with Low Depth Circuits
Secure two-party computation is a rapidly emerging field of research and enables a large variety of privacy-preserving applications such as mobile social networks or biometric identification. In the late eighties, two different approaches were proposed: Yao’s garbled circuits and the protocol of Goldreich-Micali-Wigderson (GMW). Since then, research has mostly focused on Yao’s garbled circuits ...
متن کاملOverlaying Circuit Clauses for Secure Computation
Given a set S = {C1, ..., Ck} of Boolean circuits, we show how to construct a universal for S circuit C0, which is much smaller than Valiant’s universal circuit or a circuit incorporating all C1, ..., Ck. Namely, given C1, ..., Ck and viewing them as directed acyclic graphs (DAGs) D1, ..., Dk, we embed them in a new graph D0. The embedding is such that a secure computation of any of C1, ..., Ck...
متن کاملAnalysis and Extensions of the PCF Secure Two-Party Computation Compiler Analyse und Erweiterungen des PCF Secure Two-Party Computation Compilers
English In 2013, the Portable Circuit Format (PCF) project was started to improve the way circuits for secure computation can efficiently be built, stored and evaluated. Secure computation is a growing field of cryptography, especially in the last decade and allows two or more parties to jointly evaluate a common function over their inputs without the need to disclose any information but the fi...
متن کاملCompiling Low Depth Circuits for Practical Secure Computation
With the rise of practical Secure Multi-party Computation (MPC) protocols, compilers have been developed that create Boolean or Arithmetic circuits for MPC from functionality descriptions in a highlevel language. Previous compilers focused on the creation of size-minimal circuits. However, many MPC protocols, such as GMW and SPDZ, have a round complexity that is dependent on the circuit’s depth...
متن کاملAd-Hoc Secure Two-Party Computation on Mobile Devices using Hardware Tokens
Secure two-party computation allows two mutually distrusting parties to jointly compute an arbitrary function on their private inputs without revealing anything but the result. An interesting target for deploying secure computation protocols are mobile devices as they contain a lot of sensitive user data. However, their resource restriction makes the deployment of secure computation protocols a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016